<!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <title>简单入门算法 | Hexo</title>
  <meta name="keywords" content="">
  <meta name="description" content="简单入门算法 | Hexo">
    <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1">
<meta name="description" content="第二章 线性表线性表：表内数据类型相同，有限序列 本章将以总结的形式展现： 2.1 顺序表与链式表的区别     顺序表 链式表     存取 随机存取 顺序存取   结构 顺序存储（连续） 随机存储（不连续）   空间分配 静态存储（可以动态分配） 动态存储   操作 查找 O(1) ,插入和删除O（n） 查找 O(n) ,插入和删除O（1）   缺点 插入删除不便，长度不可以改变 查找速度慢，">
<meta property="og:type" content="article">
<meta property="og:title" content="数据结构">
<meta property="og:url" content="http://yoursite.com/2021/03/12/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/index.html">
<meta property="og:site_name" content="Hexo">
<meta property="og:description" content="第二章 线性表线性表：表内数据类型相同，有限序列 本章将以总结的形式展现： 2.1 顺序表与链式表的区别     顺序表 链式表     存取 随机存取 顺序存取   结构 顺序存储（连续） 随机存储（不连续）   空间分配 静态存储（可以动态分配） 动态存储   操作 查找 O(1) ,插入和删除O（n） 查找 O(n) ,插入和删除O（1）   缺点 插入删除不便，长度不可以改变 查找速度慢，">
<meta property="og:locale" content="en_US">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/23/171951-630686.png">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/23/171844-136893.png">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/19/203103-111988.jpeg">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/23/171839-101678.jpeg">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/23/200119-510473.png">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202103/05/113954-515448.png">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/23/203146-263519.jpeg">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/19/153239-688589.png">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/19/153248-836462.png">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/19/153259-101399.png">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202103/11/113055-306258.jpeg">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/19/151817-474283.png">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/02/103950-168345.png">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/02/105245-140913.png">
<meta property="og:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/19/153313-134836.png">
<meta property="article:published_time" content="2021-03-11T16:00:00.000Z">
<meta property="article:modified_time" content="2021-03-11T07:19:09.038Z">
<meta property="article:author" content="MOLU">
<meta name="twitter:card" content="summary">
<meta name="twitter:image" content="https://gitee.com/moluggg/image/raw/master/img/202102/23/171951-630686.png">


<link rel="icon" href="/img/avatar.jpg">

<link href="/css/style.css?v=1.1.0" rel="stylesheet">

<link href="/css/hl_theme/github.css?v=1.1.0" rel="stylesheet">

<link href="//cdn.jsdelivr.net/npm/animate.css@4.1.0/animate.min.css" rel="stylesheet">

<script src="//cdn.jsdelivr.net/npm/jquery@3.5.1/dist/jquery.min.js"></script>
<script src="/js/titleTip.js?v=1.1.0" ></script>

<script src="//cdn.jsdelivr.net/npm/highlightjs@9.16.2/highlight.pack.min.js"></script>
<script>
    hljs.initHighlightingOnLoad();
</script>

<script src="//cdn.jsdelivr.net/npm/nprogress@0.2.0/nprogress.min.js"></script>



<script src="//cdn.jsdelivr.net/npm/jquery.cookie@1.4.1/jquery.cookie.min.js" ></script>

<script src="/js/iconfont.js?v=1.1.0" ></script>

<meta name="generator" content="Hexo 5.0.0"></head>
<div style="display: none">
  <input class="theme_disqus_on" value="false">
  <input class="theme_preload_comment" value="">
  <input class="theme_blog_path" value="">
  <input id="theme_shortcut" value="true" />
</div>


<body>
<aside class="nav">
    <div class="nav-left">
        <a href="/" class="avatar_target">
    <img class="avatar" src="/img/avatar.jpg" />
</a>
<div class="author">
    <span>MOLU</span>
</div>

<div class="icon">
    
        
        <a title="rss" href="/atom.xml" target="_blank">
            
                <i class="iconfont icon-rss"></i>
            
        </a>
        
    
        
        <a title="github" href="https://github.com/molu-ggg" target="_blank">
            
                <i class="iconfont icon-github"></i>
            
        </a>
        
    
        
    
        
    
        
        <a title="email" href="mailto:2572876783@qq.com" target="_blank">
            
                <i class="iconfont icon-email"></i>
            
        </a>
        
    
</div>




<ul>
    <li><div class="all active" data-rel="All">All<small>(35)</small></div></li>
    
        
            
            <li><div data-rel="AI论文">AI论文<small>(5)</small></div>
                
            </li>
            
        
    
        
            
            <li><div data-rel="专业知识">专业知识<small>(2)</small></div>
                
            </li>
            
        
    
        
            
            <li><div data-rel="数学">数学<small>(2)</small></div>
                
            </li>
            
        
    
        
            
            <li><div data-rel="机器学习">机器学习<small>(12)</small></div>
                
            </li>
            
        
    
        
            
            <li><div data-rel="经典算法">经典算法<small>(10)</small></div>
                
            </li>
            
        
    
</ul>
<div class="left-bottom">
    <div class="menus">
    
    
    
    
    </div>
    <div><a class="about  hasFriend  site_url"  href="/about">About</a><a style="width: 50%"  class="friends">Friends</a></div>
</div>
<input type="hidden" id="yelog_site_posts_number" value="35">

<div style="display: none">
    <span id="busuanzi_value_site_uv"></span>
    <span id="busuanzi_value_site_pv"></span>
</div>

    </div>
    <div class="nav-right">
        <div class="friends-area">
    <div class="friends-title">
        Links
        <i class="iconfont icon-left"></i>
    </div>
    <div class="friends-content">
        <ul>
            
            <li><a target="_blank" href="http://yelog.org/">叶落阁</a></li>
            
        </ul>
    </div>
</div>
        <div class="title-list">
    <div class="right-top">
        <div id="default-panel">
            <i class="iconfont icon-search" data-title="搜索 快捷键 i"></i>
            <div class="right-title">All</div>
            <i class="iconfont icon-file-tree" data-title="切换到大纲视图 快捷键 w"></i>
        </div>
        <div id="search-panel">
            <i class="iconfont icon-left" data-title="返回"></i>
            <input id="local-search-input" />
            <label class="border-line" for="input"></label>
            <i class="iconfont icon-case-sensitive" data-title="大小写敏感"></i>
            <i class="iconfont icon-tag" data-title="标签"></i>
        </div>
        <div id="outline-panel" style="display: none">
            <div class="right-title">大纲</div>
            <i class="iconfont icon-list" data-title="切换到文章列表"></i>
        </div>
    </div>

    <div class="tags-list">
    <input id="tag-search" />
    <div class="tag-wrapper">
        
            <li class="article-tag-list-item">
                <i class="iconfont icon-tag"></i><a>50</a>
            </li>
        
            <li class="article-tag-list-item">
                <i class="iconfont icon-tag"></i><a>AI</a>
            </li>
        
            <li class="article-tag-list-item">
                <i class="iconfont icon-tag"></i><a>数据结构，最短路径，图</a>
            </li>
        
            <li class="article-tag-list-item">
                <i class="iconfont icon-tag"></i><a>机器学习</a>
            </li>
        
            <li class="article-tag-list-item">
                <i class="iconfont icon-tag"></i><a>相似度计算</a>
            </li>
        
    </div>

</div>

    
    <div id="local-search-result">

    </div>
    
    <nav id="title-list-nav">
        
        <a id="top" class="All 经典算法 "
           href="/2020/07/20/b_leetcode/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="leetcode &amp; 蓝桥">leetcode &amp; 蓝桥</span>
            <span class="post-date" title="2020-07-20 00:00:00">2020/07/20</span>
        </a>
        
        <a id="top" class="All AI论文 "
           href="/2020/07/10/d_GAT/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="GAT">GAT</span>
            <span class="post-date" title="2020-07-10 08:50:20">2020/07/10</span>
        </a>
        
        <a  class="All 专业知识 "
           href="/2021/03/12/%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BB%84%E6%88%90%E5%8E%9F%E7%90%86/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="计算机组成原理">计算机组成原理</span>
            <span class="post-date" title="2021-03-12 00:00:00">2021/03/12</span>
        </a>
        
        <a  class="All 专业知识 "
           href="/2021/03/12/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="数据结构">数据结构</span>
            <span class="post-date" title="2021-03-12 00:00:00">2021/03/12</span>
        </a>
        
        <a  class="All 经典算法 "
           href="/2020/12/05/b_%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E4%B8%8E%E8%AE%B0%E5%BF%86%E5%8C%96%E6%90%9C%E7%B4%A2/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="动态规划记忆化">动态规划记忆化</span>
            <span class="post-date" title="2020-12-05 00:00:00">2020/12/05</span>
        </a>
        
        <a  class="All AI论文 "
           href="/2020/07/25/d_300-paperDAT/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="DAT for recommender">DAT for recommender</span>
            <span class="post-date" title="2020-07-25 08:50:20">2020/07/25</span>
        </a>
        
        <a  class="All 数学 "
           href="/2020/07/20/a_%E7%AE%97%E6%B3%95/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="算法总结">算法总结</span>
            <span class="post-date" title="2020-07-20 00:00:00">2020/07/20</span>
        </a>
        
        <a  class="All 数学 "
           href="/2020/07/20/a_%E6%95%B0%E5%AD%A6/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="数学">数学</span>
            <span class="post-date" title="2020-07-20 00:00:00">2020/07/20</span>
        </a>
        
        <a  class="All "
           href="/2020/07/05/%E5%AF%B9%E9%9A%90%E7%A7%98%E7%9A%84%E8%A7%92%E8%90%BD%E7%94%B5%E8%A7%86%E5%89%A7%E7%9A%84%E6%84%9F%E6%82%9F%E4%BB%A5%E5%8F%8A%E8%AE%A4%E8%AF%86/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="对隐秘的角落电视剧的感悟以及认识">对隐秘的角落电视剧的感悟以及认识</span>
            <span class="post-date" title="2020-07-05 00:00:00">2020/07/05</span>
        </a>
        
        <a  class="All 经典算法 "
           href="/2020/07/04/a_%E6%A8%A1%E6%9D%BF%E5%BA%93/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="模板库">模板库</span>
            <span class="post-date" title="2020-07-04 08:50:20">2020/07/04</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2020/07/04/a_%E7%99%BE%E5%BA%A6%E6%8A%80%E6%9C%AF%E8%AE%A4%E8%AF%81/"
           data-tag="AI,机器学习"
           data-author="" >
            <span class="post-title" title="百度技术认证">百度技术认证</span>
            <span class="post-date" title="2020-07-04 08:50:20">2020/07/04</span>
        </a>
        
        <a  class="All AI论文 "
           href="/2020/07/01/d_GCN%E8%AE%BA%E6%96%87%E8%A7%A3%E8%AF%BB/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="GCN">GCN</span>
            <span class="post-date" title="2020-07-01 08:50:20">2020/07/01</span>
        </a>
        
        <a  class="All AI论文 "
           href="/2020/06/04/d_word2vec_node2vec/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="Word2vec &amp; Node2vec">Word2vec &amp; Node2vec</span>
            <span class="post-date" title="2020-06-04 08:50:20">2020/06/04</span>
        </a>
        
        <a  class="All AI论文 "
           href="/2020/05/05/d_GAN/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="GAN">GAN</span>
            <span class="post-date" title="2020-05-05 08:50:20">2020/05/05</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2020/05/04/d_Deepwalk/"
           data-tag="AI,机器学习"
           data-author="" >
            <span class="post-title" title="DEEPWALK">DEEPWALK</span>
            <span class="post-date" title="2020-05-04 08:50:20">2020/05/04</span>
        </a>
        
        <a  class="All 经典算法 "
           href="/2020/02/15/b_%E8%B4%AA%E5%BF%83/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="贪心与动态规划">贪心与动态规划</span>
            <span class="post-date" title="2020-02-15 00:00:00">2020/02/15</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2020/02/12/a_2020/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="机器学习零散知识记录">机器学习零散知识记录</span>
            <span class="post-date" title="2020-02-12 00:00:00">2020/02/12</span>
        </a>
        
        <a  class="All 经典算法 "
           href="/2020/02/12/b_%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="动态规划——背包问题">动态规划——背包问题</span>
            <span class="post-date" title="2020-02-12 00:00:00">2020/02/12</span>
        </a>
        
        <a  class="All 经典算法 "
           href="/2020/02/03/b_%E8%93%9D%E6%A1%A5%E6%9D%AF%E7%BB%83%E4%B9%A0%E9%A2%98/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="蓝桥杯">蓝桥杯</span>
            <span class="post-date" title="2020-02-03 00:00:00">2020/02/03</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2020/01/20/c_%E5%86%B3%E7%AD%96%E6%A0%91/"
           data-tag="50"
           data-author="" >
            <span class="post-title" title="决策树总结">决策树总结</span>
            <span class="post-date" title="2020-01-20 00:00:00">2020/01/20</span>
        </a>
        
        <a  class="All 经典算法 "
           href="/2020/01/12/b_%E5%85%A8%E6%8E%92%E5%88%97/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="全排列">全排列</span>
            <span class="post-date" title="2020-01-12 00:00:00">2020/01/12</span>
        </a>
        
        <a  class="All 经典算法 "
           href="/2019/12/02/b_%E6%9C%89%E7%A9%B7%E8%87%AA%E5%8A%A8%E6%9C%BA/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="有穷自动机">有穷自动机</span>
            <span class="post-date" title="2019-12-02 00:00:00">2019/12/02</span>
        </a>
        
        <a  class="All 经典算法 "
           href="/2019/11/20/b_%E9%94%99%E6%8E%92%E5%85%AC%E5%BC%8F/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="错排公式">错排公式</span>
            <span class="post-date" title="2019-11-20 00:00:00">2019/11/20</span>
        </a>
        
        <a  class="All "
           href="/2019/10/29/a_%E5%BC%97%E6%B4%9B%E4%BC%8A%E5%BE%B7/"
           data-tag="数据结构，最短路径，图"
           data-author="" >
            <span class="post-title" title="最短路径之弗洛伊德算法">最短路径之弗洛伊德算法</span>
            <span class="post-date" title="2019-10-29 00:00:00">2019/10/29</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2019/08/04/c_BPR/"
           data-tag="AI,机器学习"
           data-author="" >
            <span class="post-title" title="贝叶斯">贝叶斯</span>
            <span class="post-date" title="2019-08-04 08:50:20">2019/08/04</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2019/08/02/c_matrix/"
           data-tag="AI,机器学习"
           data-author="" >
            <span class="post-title" title="矩阵分解与正则化">矩阵分解与正则化</span>
            <span class="post-date" title="2019-08-02 08:25:59">2019/08/02</span>
        </a>
        
        <a  class="All "
           href="/2019/07/28/c_coordination1/"
           data-tag="AI,机器学习,相似度计算"
           data-author="" >
            <span class="post-title" title="协同过滤-上">协同过滤-上</span>
            <span class="post-date" title="2019-07-28 08:25:59">2019/07/28</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2019/07/26/c_cnn/"
           data-tag="AI,机器学习"
           data-author="" >
            <span class="post-title" title="cnn">cnn</span>
            <span class="post-date" title="2019-07-26 18:54:51">2019/07/26</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2019/07/22/c_coordination2/"
           data-tag="AI,机器学习"
           data-author="" >
            <span class="post-title" title="协同过滤—下">协同过滤—下</span>
            <span class="post-date" title="2019-07-22 18:54:26">2019/07/22</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2019/07/22/c_kmeans/"
           data-tag="AI,机器学习"
           data-author="" >
            <span class="post-title" title="K-means算法">K-means算法</span>
            <span class="post-date" title="2019-07-22 18:53:07">2019/07/22</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2019/07/21/c_nerve2/"
           data-tag="AI,机器学习"
           data-author="" >
            <span class="post-title" title="神经网络-下">神经网络-下</span>
            <span class="post-date" title="2019-07-21 11:37:18">2019/07/21</span>
        </a>
        
        <a  class="All "
           href="/2019/07/20/c_nerve1/"
           data-tag="AI,机器学习"
           data-author="" >
            <span class="post-title" title="神经网络—上">神经网络—上</span>
            <span class="post-date" title="2019-07-20 17:29:10">2019/07/20</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2019/06/22/c_gradient/"
           data-tag="AI,机器学习"
           data-author="" >
            <span class="post-title" title="线性回归与梯度下降算法">线性回归与梯度下降算法</span>
            <span class="post-date" title="2019-06-22 08:26:36">2019/06/22</span>
        </a>
        
        <a  class="All 机器学习 "
           href="/2019/06/19/c_flyback/"
           data-tag="AI,机器学习"
           data-author="" >
            <span class="post-title" title="线性回归">线性回归</span>
            <span class="post-date" title="2019-06-19 00:00:00">2019/06/19</span>
        </a>
        
        <a  class="All 经典算法 "
           href="/2019/05/20/b_%E8%A7%86%E9%A2%91%E7%BB%8F%E5%85%B8%E7%AE%97%E6%B3%95/"
           data-tag=""
           data-author="" >
            <span class="post-title" title="简单入门算法">简单入门算法</span>
            <span class="post-date" title="2019-05-20 00:00:00">2019/05/20</span>
        </a>
        
        <div id="no-item-tips">

        </div>
    </nav>
    <div id="outline-list">
    </div>
</div>
    </div>
    <div class="hide-list">
        <div class="semicircle" data-title="切换全屏 快捷键 s">
            <div class="brackets first"><</div>
            <div class="brackets">&gt;</div>
        </div>
    </div>
</aside>
<div id="post">
    <div class="pjax">
        <article id="post-b_视频经典算法" class="article article-type-post" itemscope itemprop="blogPost">
    
        <h1 class="article-title">简单入门算法</h1>
    
    <div class="article-meta">
        
        
        
        <span class="book">
            <i class="iconfont icon-category"></i>
            
            
            <a  data-rel="经典算法">经典算法</a>
            
        </span>
        
        
    </div>
    <div class="article-meta">
        
            Created At : <time class="date" title='Updated At: 2020-08-09 14:28:07'>2019-05-20 00:00</time>
        
    </div>
    <div class="article-meta">
        
        
        <span id="busuanzi_container_page_pv">
            Views 👀 :<span id="busuanzi_value_page_pv">
                <span class="count-comment">
                    <span class="spinner">
                      <div class="cube1"></div>
                      <div class="cube2"></div>
                    </span>
                </span>
            </span>
        </span>
        
        
    </div>
    
    <div class="toc-ref">
    
        <ol class="toc"><li class="toc-item toc-level-1"><a class="toc-link" href="#%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%EF%BC%9A"><span class="toc-text">动态规划：</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E9%80%92%E6%8E%A8%E9%97%AE%E9%A2%98%EF%BC%9A"><span class="toc-text">递推问题：</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%85%94%E5%AD%90%E7%94%9F%E5%85%94%E5%AD%90%EF%BC%9A"><span class="toc-text">兔子生兔子：</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%8F%B0%E9%98%B6%E9%97%AE%E9%A2%98%EF%BC%9A"><span class="toc-text">台阶问题：</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E9%94%99%E6%8E%92%E9%97%AE%E9%A2%98%EF%BC%9A"><span class="toc-text">错排问题：</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E9%9D%9E%E6%95%B0%E7%BB%84%E8%A1%A8%E7%A4%BA%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97"><span class="toc-text">非数组表示斐波那契数列</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%BA%8C%E7%BB%B4%E9%80%92%E6%8E%A8%EF%BC%9A"><span class="toc-text">二维递推：</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%B8%89%E7%BB%B4%E9%80%92%E6%8E%A8%EF%BC%9A"><span class="toc-text">三维递推：</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#grey-question-%E7%8E%B0%E5%9C%A8%E8%AE%A9%E4%BD%A0%E5%8F%98%E6%88%90%E4%BA%8C%E7%BB%B4%E7%9A%84%E4%BD%A0%E4%BC%9A%E5%90%97%EF%BC%9F"><span class="toc-text">:grey_question:    现在让你变成二维的你会吗？**</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%A4%A7%E6%95%B0%E7%9B%B8%E4%B9%98%E6%80%8E%E4%B9%88%E5%A4%84%E7%90%86"><span class="toc-text">大数相乘怎么处理</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%AE%97%E6%B3%95%EF%BC%9A%E7%BA%BF%E6%AE%B5%E6%A0%91"><span class="toc-text">算法：线段树</span></a></li></ol></li></ol>
    
<style>
    .left-col .switch-btn,
    .left-col .switch-area {
        display: none;
    }
    .toc-level-4 i,
    .toc-level-4 ol {
        display: none !important;
    }
</style>
</div>
    
    <div class="article-entry" itemprop="articleBody">
      
        <p>1.</p>
<p>在为0-n整数的一维坐标轴上移动：</p>
<p>走一步的方式有三种：</p>
<p>向前走一步，</p>
<p>向后走一步</p>
<p>向前走坐标的一倍</p>
<p>求A到B的最短step：</p>
<p>:grey_question:       这是什么问题那？？需要归类一下</p>
<p>可以用队列解决</p>
<pre><code class="lang-c++">#include &lt;iostream&gt;
#include&lt;queue&gt;
using namespace std;
queue&lt;pair&lt;int ,int&gt; &gt;q;
int vis[1000010];


int bfs(int A,int B,int n)&amp;#123;
    //10 2 7
    int x;
       q.push(make_pair(A,0));
        while(!q.empty())&amp;#123;
        x=q.front().first;
        int step=q.front().second;
        q.pop();
        if(x==B)&amp;#123;
                cout&lt;&lt;step&lt;&lt;endl;
                return 0;
        &amp;#125;
        if(x-1&gt;=0&amp;&amp;!vis[x-1])&amp;#123;
            q.push(make_pair(x-1,step+1));
            vis[x-1]=true;
        &amp;#125;
        if(x+1&lt;=n&amp;&amp;!vis[x+1])&amp;#123;
            q.push(make_pair(x+1,step+1));
            vis[x+1]=true;
        &amp;#125;
        if(x*2&lt;=n&amp;&amp;!vis[x*2])&amp;#123;
            q.push(make_pair(x*2,step+1));
        &amp;#125;

        &amp;#125;

    &amp;#125;
int main()&amp;#123;
    int n,A,B;
    cin&gt;&gt;n&gt;&gt;A&gt;&gt;B;
   bfs(A,B,n);
    return 0;
&amp;#125;
</code></pre>
<h1 id="动态规划："><a href="#动态规划：" class="headerlink" title="动态规划："></a>动态规划：</h1><h2 id="递推问题："><a href="#递推问题：" class="headerlink" title="递推问题："></a>递推问题：</h2><p>递推考虑两种情况：<br><strong>结束的时候值为几</strong></p>
<p><strong>n-1的时候怎么表示</strong></p>
<h2 id="兔子生兔子："><a href="#兔子生兔子：" class="headerlink" title="兔子生兔子："></a>兔子生兔子：</h2><p>兔子两个月成年，一对兔子每个月能产生一对兔子，问：2年后能产生多少兔子？</p>
<p>可以分类探讨各种种类的情况：</p>
<div class="table-container">
<table>
<thead>
<tr>
<th>月份</th>
<th>成年兔子</th>
<th>幼年兔子2</th>
<th>幼年兔子1</th>
</tr>
</thead>
<tbody>
<tr>
<td>1</td>
<td>1</td>
<td>0</td>
<td>1</td>
</tr>
<tr>
<td>2</td>
<td>1</td>
<td>1</td>
<td>1</td>
</tr>
<tr>
<td>3</td>
<td>2</td>
<td>1</td>
<td>1</td>
</tr>
<tr>
<td>4</td>
<td>3</td>
<td>1</td>
<td>2</td>
</tr>
<tr>
<td>5</td>
<td>4</td>
<td>2</td>
<td>3</td>
</tr>
<tr>
<td>6</td>
<td>6</td>
<td>3</td>
<td>4</td>
</tr>
<tr>
<td>7</td>
<td>9</td>
<td>4</td>
<td>6</td>
</tr>
</tbody>
</table>
</div>
<p>不难发现：$F_n=F_{n-1} +F_{n-3}$</p>
<p>这个可以变很多型：三月成年，四月成年等等，不离开本质</p>
<pre><code class="lang-c++">#include&lt;bits\stdc++.h&gt;
using namespace std;


int main()&amp;#123;

    int old[1000],yg1[1000],yg2[1000];
    old[1]=1,yg1[1]=1,yg2[1]=0;
    old[2]=1,yg1[2]=1,yg2[2]=1;
    old[3]=2,yg1[3]=1,yg2[3]=1;
    old[4]=3,yg1[4]=2,yg2[4]=1;
    for(int i=5;i&lt;=24;i++)&amp;#123;
        old[i]=old[i-1]+old[i-3];
        yg1[i]=old[i-1];
        yg2[i]=old[i-2];
        cout&lt;&lt;old[i]&lt;&lt;&quot; &quot;&lt;&lt;yg2[i]&lt;&lt;&quot; &quot;&lt;&lt;yg1[i]&lt;&lt;endl;
    &amp;#125;
    long long int  sum=yg1[24]+yg2[24]+old[24];
    cout&lt;&lt;sum;
&amp;#125;
</code></pre>
<h2 id="台阶问题："><a href="#台阶问题：" class="headerlink" title="台阶问题："></a>台阶问题：</h2><p>一共有n个台阶，每次你只能走一步或者两步，一共有多少种方法到达？</p>
<p>这个可以想两头：</p>
<p>最后到达第n台阶:</p>
<p>可以：$F_{n}=F_{n-1}$或者  $F_{n}=F_{n-2}$</p>
<p>$F_{n-1}=F_{n-2}+$或者$F_{n-1}=F_{n-3}$</p>
<div class="table-container">
<table>
<thead>
<tr>
<th>台阶数</th>
<th>种类数</th>
</tr>
</thead>
<tbody>
<tr>
<td>1</td>
<td>1</td>
</tr>
<tr>
<td>2</td>
<td>2</td>
</tr>
<tr>
<td>3</td>
<td>1+2=3</td>
</tr>
<tr>
<td>4</td>
<td>3+2=5</td>
</tr>
</tbody>
</table>
</div>
<p>可以递推出：$F_{n}=F_{n-1}+F_{n-2}$</p>
<p>n条线最多划分平面的问题:（3点不共点）</p>
<div class="table-container">
<table>
<thead>
<tr>
<th>1</th>
<th>2</th>
</tr>
</thead>
<tbody>
<tr>
<td>2</td>
<td>4</td>
</tr>
<tr>
<td>3</td>
<td>7</td>
</tr>
<tr>
<td>4</td>
<td>11</td>
</tr>
<tr>
<td>5</td>
<td>16</td>
</tr>
</tbody>
</table>
</div>
<p>每一次都是前一次的数加上前两次的差+1</p>
<p>$F_{n}=F_{n-1}+F_{n-1}-F_{n-2}+1$</p>
<p>就变成了$F_{n}=2*F_{n-1}-F_{n-2}+1$</p>
<p>如果有时候：数很大的话，我们通常就是化时间为空间，降维，或者思考别的办法，特别是数学公式</p>
<p>很显然，这里可以用数学公式：</p>
<script type="math/tex; mode=display">
F_{n}=\frac {n(n+1)}{2}</script><h2 id="错排问题："><a href="#错排问题：" class="headerlink" title="错排问题："></a>错排问题：</h2><p>最后一步是：<br>前n-1封都排对了，只有最后一封没有排对，则将最后一封信跟前面的交换，容然成立，则种类数是：</p>
<p>$F_{n}=F_{n-1}*(n-1)$</p>
<p>这个时候要继续想：是否有其他情况的存在：</p>
<p>前n-1封只有一封排对了，可以将该封与最后一封进行交换，现在想如何表示前n-1封中只有一封派对了那？</p>
<p>继续研究前n-1封，假设前n-2封全错，只有最后一封对了，或者将某一位空余出来，其他的乱排，一共<strong>n-1</strong>种，则表示为是$（n-1)*F_{n-2}$</p>
<p>则综合上述，表示为：</p>
<script type="math/tex; mode=display">
F_{n}=(n-1)*(F_{n-1}+F_{n-2})</script><h2 id="非数组表示斐波那契数列"><a href="#非数组表示斐波那契数列" class="headerlink" title="非数组表示斐波那契数列"></a>非数组表示斐波那契数列</h2><p>不用数组的解决方法：用三个数表示</p>
<p>大家都知道斐波那契数列的表示：$F_{n}=F_{n-1}+F_{n-2}$</p>
<p>但是往往数组表示不了很大的数，则如果用三个数来表示的话：</p>
<pre><code class="lang-c++">#include&lt;bits\stdc++.h&gt;
using namespace std;

int main()&amp;#123;
    int x,y,z;x=1,y=1;int n;
    cin&gt;&gt;n;
    for(int i=1;i&lt;=n;i++)&amp;#123;
        z=x+y;
        cout&lt;&lt;x&lt;&lt;&quot; &quot;&lt;&lt;y&lt;&lt;&quot; &quot;&lt;&lt;z&lt;&lt;endl;
        y=x;x=z;    
    &amp;#125;
&amp;#125;
</code></pre>
<h2 id="二维递推："><a href="#二维递推：" class="headerlink" title="二维递推："></a>二维递推：</h2><p>只有向下和向右两种走法的：过河卒</p>
<p>原题是从（0,0）到（n,m)：</p>
<p>问题是求走法，数据范围：1&lt;n,m&lt;=20</p>
<p>别看n,m都在20以内，事假上数是很大的！！！</p>
<p>注意：边缘的处理</p>
<p><img src="https://moluggg.oss-cn-qingdao.aliyuncs.com/img/b4b93d4e0a5a20989714cf5b52670211_dqlo9i4w.png"/></p>
<pre><code class="lang-c++">#include&lt;bits\stdc++.h&gt;
using namespace std;
int vis[1000][1000];
int dx[]=&amp;#123;1,1,-1,-1,2,2,-2,-2&amp;#125;;
int dy[]=&amp;#123;2,-2,2,-2,1,-1,1,-1&amp;#125;;
long long int  F[1000][1000];
int main()&amp;#123;

     int n,m;
     int i,j;
     int hx,hy;
     cin&gt;&gt;n&gt;&gt;m&gt;&gt;hx&gt;&gt;hy;
     hx+=1;
     hy+=1;
     vis[hx][hy]=1;
     for(i=0;i&lt;=m+2;i++)&amp;#123;
         vis[0][i]=1;
         vis[n+2][i]=1;
     &amp;#125; 
     for(i=0;i&lt;=n+2;i++)&amp;#123;
         vis[i][0]=1;
         vis[i][m+2]=1;
     &amp;#125; 
     for(i=0;i&lt;8;i++)&amp;#123;
         if(hx+dx[i]&lt;0||hy+dy[i]&lt;0) continue;
         vis[hx+dx[i]][hy+dy[i]]=1;
     &amp;#125;
     F[1][1]=1;
     for(i=1;i&lt;=n+1;i++)&amp;#123;
        for(j=1;j&lt;=m+1;j++)&amp;#123;

            if(i==1&amp;&amp;j==1) continue;
            if(!vis[i][j])
            F[i][j]=F[i-1][j]+F[i][j-1];
        &amp;#125;

     &amp;#125;
     cout&lt;&lt;F[n+1][m+1];
&amp;#125;
</code></pre>
<h2 id="三维递推："><a href="#三维递推：" class="headerlink" title="三维递推："></a>三维递推：</h2><p>正方体：</p>
<pre><code class="lang-c++">int F[100][100][100];
int i,j,k;
for(i=1;i&lt;=20;i++)&amp;#123;
    for(j=1;j&lt;=20;j++)&amp;#123;
        for(k=1;k&lt;=20;k++)&amp;#123;
            F[i][j][k]=F[i-1][j][k]+F[i][j-1][k]+F[i][j][k-1];
        &amp;#125;
    &amp;#125;
&amp;#125;
</code></pre>
<h3 id="grey-question-现在让你变成二维的你会吗？"><a href="#grey-question-现在让你变成二维的你会吗？" class="headerlink" title=":grey_question:    现在让你变成二维的你会吗？**"></a>:grey_question:    现在让你变成二维的你会吗？**</h3><p>算法课上的问题：</p>
<h2 id="大数相乘怎么处理"><a href="#大数相乘怎么处理" class="headerlink" title="大数相乘怎么处理"></a>大数相乘怎么处理</h2><p>大数相加</p>
<p>二维递推：<br>杨辉三角</p>
<p>走路传纸条问题：</p>
<p>只有向下和向右两种走法的：过河卒</p>
<p>三维递推：</p>
<p>正方体</p>
<p>算法课上的问题：</p>
<p>大数相乘怎么处理：</p>
<p>大数相加</p>
<p>bfs密码锁：</p>
<p><img src="https://moluggg.oss-cn-qingdao.aliyuncs.com/img/20200302133704.png"/></p>
<p><img src="https://moluggg.oss-cn-qingdao.aliyuncs.com/img/5a493acc9900f07c6a72963414cb46c3_70.png"/></p>
<p>3.</p>
<p><a target="_blank" rel="noopener" href="https://www.cnblogs.com/jiamian/p/12189981.html">https://www.cnblogs.com/jiamian/p/12189981.html</a></p>
<p>4.</p>
<p>三阶平面魔方</p>
<p>5.邻接表的存储</p>
<p><a target="_blank" rel="noopener" href="https://nanti.jisuanke.com/t/A1068">https://nanti.jisuanke.com/t/A1068</a></p>
<p>6》</p>
<p><a target="_blank" rel="noopener" href="https://blog.csdn.net/qq_40526226/article/details/84146970">https://blog.csdn.net/qq_40526226/article/details/84146970</a></p>
<p>7》旋转数组的最小数字</p>
<p><a target="_blank" rel="noopener" href="https://www.cnblogs.com/hesper/p/10417550.html">https://www.cnblogs.com/hesper/p/10417550.html</a></p>
<p>辗转相除法：</p>
<pre><code class="lang-c++">#include&lt;bits\stdc++.h&gt;
using namespace std;


int main()&amp;#123;


    int m,n,t,k,k1,k2;
    cin&gt;&gt;m&gt;&gt;n;
    k1=m,k2=n;
    if(m&lt;n)&amp;#123;
        t=m;m=n;n=t;
    &amp;#125;
    k=m%n;
    while(k) &amp;#123;
       m=n;
       n=k;
       k=m%n;    
    &amp;#125;
    cout&lt;&lt;n&lt;&lt;endl;//最大公因数
    cout&lt;&lt; (k1/n)*(k2/n)*n&lt;&lt;endl;

&amp;#125;
</code></pre>
<p>汉诺塔：</p>
<pre><code class="lang-c++">#include&lt;bits\stdc++.h&gt;
using namespace std;


void digui(int n,string A,string B,string C) &amp;#123;

    if(n==0) return ;
    else if(n==1)&amp;#123;
        cout&lt;&lt;n&lt;&lt;&quot; from &quot;&lt;&lt;A&lt;&lt;&quot; to &quot;&lt;&lt;B&lt;&lt;endl;
    &amp;#125;
    else &amp;#123;
        digui(n-1,A,C,B);
        cout&lt;&lt;n&lt;&lt;&quot; from &quot;&lt;&lt;A&lt;&lt;&quot; to &quot;&lt;&lt;B&lt;&lt;endl;
        digui(n-1,C,B,A);
    &amp;#125;
&amp;#125;

int main()&amp;#123;

    string A,B,C; 
    int n;
    cin&gt;&gt;n;
    A=&quot;A&quot;,B=&#39;B&#39;,C=&#39;C&#39;;
    digui(n,A,B,C);
    //将A的前N-1移到C,
    //将A的N移动B;
    //将c的n-1移动B
    //循环往复 

&amp;#125;
</code></pre>
<p>抽象DFS：</p>
<p>等边三角形</p>
<p>n皇后问题</p>
<h2 id="算法：线段树"><a href="#算法：线段树" class="headerlink" title="算法：线段树"></a>算法：线段树</h2><p>线段树是平衡二叉树</p>
<p>平衡二叉树</p>
<p>map，vector，set的应用</p>
<p>动态规划的应用</p>
<p>图论:</p>
<p>Tarjan:</p>
<p><img src="https://gitee.com/moluggg/image/raw/master/20200402185718.png"/></p>
<p>访问顺序不是访问的顺序</p>
<p><img src="https://gitee.com/moluggg/image/raw/master/20200402190423.png"/></p>
<p>先搜索他的下一个点，然访问自己</p>
<p><img src="https://gitee.com/moluggg/image/raw/master/20200402225715.png"/></p>

      
       <hr><span style="font-style: italic;color: gray;"> 转载请注明来源，欢迎对文章中的引用来源进行考证，欢迎指出任何有错误或不够清晰的表达。可以在下面评论区评论，也可以邮件至 2572876783@qq.com </span>
    </div>
</article>


<p>
    <a  class="dashang" onclick="dashangToggle()">💰</a>
</p>






    
        <!-- MathJax配置，可通过单美元符号书写行内公式等 -->
<script type="text/x-mathjax-config">
    MathJax.Hub.Config({
    "HTML-CSS": {
        preferredFont: "TeX",
        availableFonts: ["STIX","TeX"],
        linebreaks: { automatic:true },
        EqnChunk: (MathJax.Hub.Browser.isMobile ? 10 : 50)
    },
    tex2jax: {
        inlineMath: [ ["$", "$"], ["\\(","\\)"] ],
        processEscapes: true,
        ignoreClass: "tex2jax_ignore|dno",
        skipTags: ['script', 'noscript', 'style', 'textarea', 'pre', 'code']
    },
    TeX: {
        equationNumbers: { autoNumber: "AMS" },
        noUndefined: { attributes: { mathcolor: "red", mathbackground: "#FFEEEE", mathsize: "90%" } },
        Macros: { href: "{}" }
    },
    messageStyle: "none"
    });
</script>
<!-- 给MathJax元素添加has-jax class -->
<script type="text/x-mathjax-config">
    MathJax.Hub.Queue(function() {
        var all = MathJax.Hub.getAllJax(), i;
        for(i=0; i < all.length; i += 1) {
            all[i].SourceElement().parentNode.className += ' has-jax';
        }
    });
</script>
<!-- 通过连接CDN加载MathJax的js代码 -->
<script type="text/javascript" async
        src="//cdn.jsdelivr.net/npm/mathjax@2.7.8/unpacked/MathJax.js?config=TeX-MML-AM_CHTML">
</script>
<input type="hidden" id="MathJax-js"
        value="//cdn.jsdelivr.net/npm/mathjax@2.7.8/unpacked/MathJax.js?config=TeX-MML-AM_CHTML">
</input>
    




    </div>
    <div class="copyright">
        <p class="footer-entry">
    ©2016-2020 MOLU
</p>
<p class="footer-entry">Built with <a href="https://hexo.io/" target="_blank">Hexo</a> and <a href="https://github.com/yelog/hexo-theme-3-hexo" target="_blank">3-hexo</a> theme</p>

    </div>
    <div class="full-toc">
        <button class="full" data-title="切换全屏 快捷键 s"><span class="min "></span></button>
<a class="" id="rocket" ></a>

    </div>
</div>

<div class="hide_box" onclick="dashangToggle()"></div>
<div class="shang_box">
    <a class="shang_close"  onclick="dashangToggle()">×</a>
    <div class="shang_tit">
        <p>Help us with donation</p>
    </div>
    <div class="shang_payimg">
        <div class="pay_img">
            <img src="/img/alipay.jpg" class="alipay" title="扫码支持">
            <img src="/img/weixin.jpg" class="weixin" title="扫码支持">
        </div>
    </div>
    <div class="shang_payselect">
        <span><label><input type="radio" name="pay" checked value="alipay">alipay</label></span><span><label><input type="radio" name="pay" value="weixin">weixin</label></span>
    </div>
</div>


</body>
<script src="/js/jquery.pjax.js?v=1.1.0" ></script>

<script src="/js/script.js?v=1.1.0" ></script>
<script>
    var img_resize = 'default';
    function initArticle() {
        /*渲染对应的表格样式*/
        
            $("#post .pjax table").addClass("green_title");
        

        /*渲染打赏样式*/
        
        $("input[name=pay]").on("click", function () {
            if($("input[name=pay]:checked").val()=="weixin"){
                $(".shang_box .shang_payimg .pay_img").addClass("weixin_img");
            } else {
                $(".shang_box .shang_payimg .pay_img").removeClass("weixin_img");
            }
        })
        

        /*高亮代码块行号*/
        

        /*访问数量*/
        
        $.getScript("//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js");
        

        /*代码高亮，行号对齐*/
        $('.pre-numbering').css('line-height',$('.has-numbering').css('line-height'));

        
        
    }

    /*打赏页面隐藏与展示*/
    
    function dashangToggle() {
        $(".shang_box").fadeToggle();
        $(".hide_box").fadeToggle();
    }
    

</script>

<!--加入行号的高亮代码块样式-->

<!--自定义样式设置-->
<style>
    
    
    .nav {
        width: 542px;
    }
    .nav.fullscreen {
        margin-left: -542px;
    }
    .nav-left {
        width: 120px;
    }
    
    
    @media screen and (max-width: 1468px) {
        .nav {
            width: 492px;
        }
        .nav.fullscreen {
            margin-left: -492px;
        }
        .nav-left {
            width: 100px;
        }
    }
    
    
    @media screen and (max-width: 1024px) {
        .nav {
            width: 492px;
            margin-left: -492px
        }
        .nav.fullscreen {
            margin-left: 0;
        }
    }
    
    @media screen and (max-width: 426px) {
        .nav {
            width: 100%;
        }
        .nav-left {
            width: 100%;
        }
    }
    
    
    .nav-right .title-list nav a .post-title, .nav-right .title-list #local-search-result a .post-title {
        color: #383636;
    }
    
    
    .nav-right .title-list nav a .post-date, .nav-right .title-list #local-search-result a .post-date {
        color: #5e5e5f;
    }
    
    
    .nav-right nav a.hover, #local-search-result a.hover{
        background-color: #e2e0e0;
    }
    
    

    /*列表样式*/
    

    /* 背景图样式 */
    
    


    /*引用块样式*/
    

    /*文章列表背景图*/
    

    
</style>







</html>
